Neighborhood Parallel Simulated Annealing
نویسندگان
چکیده
منابع مشابه
Temperature Parallel Simulated Annealing with Adaptive Neighborhood
In this paper, a Temperature Parallel Simulated Annealing with Adaptive Neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...
متن کاملTemperature Parallel Simulated Annealing with Adaptive Neighborhood for Continuous Optimization Problem
In this study, a temperature parallel simulated annealing with adaptive neighborhood (TPSA/AN) for continuous optimization problems is introduced. TPSA/AN is based on the temperature parallel simulated annealing (TPSA), which is suitable for parallel processing, and the SA that Corana developed for continuous optimization problems. The moves in TPSA/AN are adjusted to have equal acceptance rate...
متن کاملSimulated parallel annealing within a neighborhood for optimization of biomechanical systems.
Optimization problems for biomechanical systems have become extremely complex. Simulated annealing (SA) algorithms have performed well in a variety of test problems and biomechanical applications; however, despite advances in computer speed, convergence to optimal solutions for systems of even moderate complexity has remained prohibitive. The objective of this study was to develop a portable pa...
متن کاملParallel Recombinative Simulated Annealing: a Genetic Algorithm Parallel Recombinative Simulated Annealing: a Genetic Algorithm
This paper introduces and analyzes a parallel method of simulated annealing. Borrowing from genetic algorithms, an eeective combination of simulated annealing and genetic algorithms, called parallel recombinative simulated annealing, is developed. This new algorithm strives to retain the desirable asymptotic convergence properties of simulated annealing, while adding the populations approach an...
متن کاملParallel simulated annealing with adaptive neighborhood determined by GA
Abstract – Simulated annealing (SA) is an effective general heuristic method for solving many optimization problems. This paper deals with the two problems in SA. One is the long computational time of the numerical annealings, and the solution to it is the parallel processing of SA. The other one is the determination of the appropriate neighborhood range in SA, and the solution to it is the int...
متن کامل